Deep reinforcement learning for stochastic last-mile delivery with crowdshipping

Stochastic last-mile delivery problems with time constraints

When a package is shipped, the customer often requires the delivery to be made within a particular time window or by a deadline. However, meeting such time requirements is difficult, and delivery companies may not always know ahead of time which customers will need a delivery. In this thesis, we present models and solution approaches for two stochastic last-mile delivery problems in which custo...

Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution

This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and vehicle fleet routing. Moreover, these problems must be solved under tight runtime constraints to be practical in real-world disaster situations. ...

The Future of Last - Mile Delivery

Transshipment Networks for Last-Mile Delivery in Congested Urban Areas1

This paper introduces the concept of transshipment networks, a collection of strategically located transshipment platforms, for efficient and flexible last-mile delivery in congested urban areas. By implementing transshipment platforms, logistics operators can select the locations, light-freight vehicle types and operating schedules that best fit specific distribution strategies, and, simultane...

Minimizing waiting time in last mile delivery for smart city

Customers consider a reliable and on-time last mile delivery in Omni-channel business as important as price and good’s quality. We focus on minimizing the waiting time for customers and carriers in last mile delivery. We model the problem as an optimization problem and develop Genetic Algorithm to solve it.